Khot, Subhash A.: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Improved lower bounds on the randomized complexity of graph properties

Amit Chakrabarti, Subhash Khot

Journal:

Random Structures & Algorithms

Year:

2007

Language:

english

File:

PDF, 163 KB

english, 2007

2

Hardness of approximating the Shortest Vector Problem in high norms

Journal:

Journal of Computer and System Sciences

Year:

2006

Language:

english

File:

PDF, 232 KB

english, 2006

3

Nonembeddability theorems via Fourier analysis

Subhash Khot, Assaf Naor

Journal:

Mathematische Annalen

Year:

2006

Language:

english

File:

PDF, 288 KB

english, 2006

4

Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique

Journal:

SIAM Journal on Computing

Year:

2006

Language:

english

File:

PDF, 475 KB

english, 2006

5

Hardness of approximating the shortest vector problem in lattices

Journal:

Journal of the ACM

Year:

2005

Language:

english

File:

PDF, 182 KB

english, 2005

6

Grothendieck-Type Inequalities in Combinatorial Optimization

Subhash Khot, Assaf Naor

Journal:

Communications on Pure and Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 344 KB

english, 2012

7

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Dinur, Irit, Guruswami, Venkatesan, Khot, Subhash, Regev, Oded

Journal:

SIAM Journal on Computing

Year:

2005

Language:

english

File:

PDF, 242 KB

english, 2005

8

$\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over Reals

Khot, Subhash, Moshkovitz, Dana

Journal:

SIAM Journal on Computing

Year:

2013

Language:

english

File:

PDF, 471 KB

english, 2013

9

[ACM Press the thiry-fourth annual ACM symposium - Montreal, Quebec, Canada (2002.05.19-2002.05.21)] Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 - On the power of unique 2-prover 1-round games

Year:

2002

Language:

english

File:

PDF, 193 KB

english, 2002

10

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Gopalan, Parikshit, Khot, Subhash, Saket, Rishi

Year:

2007

Language:

english

File:

PDF, 380 KB

english, 2007

11

Guest column: inapproximability results via Long Code based PCPs

Journal:

ACM SIGACT News

Year:

2005

Language:

english

File:

PDF, 7.54 MB

english, 2005

12

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Optimal Long Code Test with One Free Bit

Bansal, Nikhil, Khot, Subhash

Year:

2009

Language:

english

File:

PDF, 290 KB

english, 2009

13

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies

Khot, Subhash, Naor, Assaf

Year:

2007

Language:

english

File:

PDF, 340 KB

english, 2007

14

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

Austrin, Per, Khot, Subhash

Journal:

IEEE Transactions on Information Theory

Year:

2014

Language:

english

File:

PDF, 831 KB

english, 2014

15

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Austrin, Per, Khot, Subhash, Safra, Muli

Year:

2009

Language:

english

File:

PDF, 313 KB

english, 2009

16

On Earthmover Distance, Metric Labeling, and 0-Extension

Karloff, Howard, Khot, Subhash, Mehta, Aranyak, Rabani, Yuval

Journal:

SIAM Journal on Computing

Year:

2009

Language:

english

File:

PDF, 266 KB

english, 2009

17

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - SDP Integrality Gaps with Local ell_1-Embeddability

Khot, Subhash, Saket, Rishi

Year:

2009

Language:

english

File:

PDF, 313 KB

english, 2009

18

[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - Unique games on expanding constraint graphs are easy

Arora, Sanjeev, Khot, Subhash A., Kolla, Alexandra, Steurer, David, Tulsiani, Madhur, Vishnoi, Nisheeth K.

Year:

2008

Language:

english

File:

PDF, 270 KB

english, 2008

19

On Agnostic Learning of Parities, Monomials, and Halfspaces

Feldman, Vitaly, Gopalan, Parikshit, Khot, Subhash, Ponnuswami, Ashok Kumar

Journal:

SIAM Journal on Computing

Year:

2009

Language:

english

File:

PDF, 486 KB

english, 2009

20

Approximate Kernel Clustering

Khot, Subhash, Naor, Assaf

Journal:

Year:

2009

Language:

english

File:

PDF, 288 KB

english, 2009

21

[ACM Press the 50th Annual ACM SIGACT Symposium - Los Angeles, CA, USA (2018.06.25-2018.06.29)] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 - Towards a proof of the 2-to-1 games conjecture?

Dinur, Irit, Khot, Subhash, Kindler, Guy, Minzer, Dor, Safra, Muli

Year:

2018

Language:

english

File:

PDF, 960 KB

english, 2018

22

On the hardness of learning intersections of two halfspaces

Subhash Khot, Rishi Saket

Journal:

Journal of Computer and System Sciences

Year:

2011

Language:

english

File:

PDF, 232 KB

english, 2011

23

Combinatorial theorems about embedding trees on the real line

Amit Chakrabarti, Subhash Khot

Journal:

Journal of Graph Theory

Year:

2011

Language:

english

File:

PDF, 161 KB

english, 2011

24

Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies

Khot, Subhash, Naor, Assaf

Journal:

SIAM Journal on Computing

Year:

2008

Language:

english

File:

PDF, 230 KB

english, 2008

25

Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing

Khot, Subhash A., Popat, Preyas, Vishnoi, Nisheeth K.

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 290 KB

english, 2014

26

[ACM Press the thirty-eighth annual ACM symposium - Seattle, WA, USA (2006.05.21-2006.05.23)] Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 - On earthmover distance, metric labeling, and 0-extension

Karloff, Howard, Khot, Subhash, Mehta, Aranyak, Rabani, Yuval

Year:

2006

Language:

english

File:

PDF, 250 KB

english, 2006

27

[ACM Press the thirty-fifth ACM symposium - San Diego, CA, USA (2003.06.09-2003.06.11)] Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 - A new multilayered PCP and the hardness of hypergraph vertex cover

Dinur, Irit, Guruswami, Venkatesan, Khot, Subhash, Regev, Oded

Year:

2003

Language:

english

File:

PDF, 179 KB

english, 2003

28

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors

Khot, Subhash, Saket, Rishi

Journal:

SIAM Journal on Computing

Year:

2017

Language:

english

File:

PDF, 434 KB

english, 2017

29

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - On independent sets, 2-to-2 games, and Grassmann graphs

Khot, Subhash, Minzer, Dor, Safra, Muli

Year:

2017

Language:

english

File:

PDF, 882 KB

english, 2017

30

[ACM Press the thirty-fifth ACM symposium - San Diego, CA, USA (2003.06.09-2003.06.11)] Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 - Cell-probe lower bounds for the partial match problem

Jayram, T. S., Khot, Subhash, Kumar, Ravi, Rabani, Yuval

Year:

2003

Language:

english

File:

PDF, 166 KB

english, 2003

31

[IEEE 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2015.10.17-2015.10.20)] 2015 IEEE 56th Annual Symposium on Foundations of Computer Science - On Monotonicity Testing and Boolean Isoperimetric Type Theorems

Khot, Subhash, Minzer, Dor, Safra, Muli

Year:

2015

Language:

english

File:

PDF, 200 KB

english, 2015

32

[ACM Press the 2016 ACM Conference - Cambridge, Massachusetts, USA (2016.01.14-2016.01.17)] Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science - ITCS '16 - On Hardness of Approximating the Parameterized Clique Problem

Khot, Subhash, Shinkar, Igor

Year:

2016

File:

PDF, 871 KB

2016

33

Fitting algebraic curves to noisy data

Sanjeev Arora, Subhash Khot

Journal:

Journal of Computer and System Sciences

Year:

2003

Language:

english

File:

PDF, 219 KB

english, 2003

34

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - NP-hardness of approximately solving linear equations over reals

Khot, Subhash, Moshkovitz, Dana

Year:

2011

Language:

english

File:

PDF, 415 KB

english, 2011

35

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - A new PCP outer verifier with applications to homogeneous linear equations and max-bisection

Holmerin, Jonas, Khot, Subhash

Year:

2004

Language:

english

File:

PDF, 243 KB

english, 2004

36

Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?

Khot, Subhash, Kindler, Guy, Mossel, Elchanan, O’Donnell, Ryan

Journal:

SIAM Journal on Computing

Year:

2007

Language:

english

File:

PDF, 382 KB

english, 2007

37

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1

Khot, Subhash A., Vishnoi, Nisheeth K.

Journal:

Journal of the ACM

Year:

2015

Language:

english

File:

PDF, 482 KB

english, 2015

38

[ACM Press the thirty-eighth annual ACM symposium - Seattle, WA, USA (2006.05.21-2006.05.23)] Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 - Integrality gaps for sparsest cut and minimum linear arrangement problems

Devanur, Nikhil R., Khot, Subhash A., Saket, Rishi, Vishnoi, Nisheeth K.

Year:

2006

Language:

english

File:

PDF, 265 KB

english, 2006

39

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta

Journal:

Year:

2008

Language:

english

File:

PDF, 347 KB

english, 2008

40

Hardness of Approximating the Closest Vector Problem with Pre-Processing

Mikhail Alekhnovich, Subhash A. Khot, Guy Kindler, Nisheeth K. Vishnoi

Journal:

Computational Complexity

Year:

2011

Language:

english

File:

PDF, 234 KB

english, 2011

41

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - SDP gaps and UGC-hardness for MAXCUTGAIN

Khot, Subhash, O'Donnell, Ryan

Year:

2006

Language:

english

File:

PDF, 187 KB

english, 2006

42

Evasiveness of Subgraph Containment and Related Properties

Chakrabarti, Amit, Khot, Subhash, Shi, Yaoyun

Journal:

SIAM Journal on Computing

Year:

2001

Language:

english

File:

PDF, 159 KB

english, 2001

43

Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Gopalan, Parikshit, Khot, Subhash, Saket, Rishi

Journal:

SIAM Journal on Computing

Year:

2010

Language:

english

File:

PDF, 337 KB

english, 2010

44

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - A Two Prover One Round Game with Strong Soundness

Khot, Subhash, Safra, Muli

Year:

2011

Language:

english

File:

PDF, 491 KB

english, 2011

45

[ACM Press the 48th Annual ACM SIGACT Symposium - Cambridge, MA, USA (2016.06.19-2016.06.21)] Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 - Candidate hard unique game

Khot, Subhash, Moshkovitz, Dana

Year:

2016

Language:

english

File:

PDF, 422 KB

english, 2016

46

On Monotonicity Testing and Boolean Isoperimetric-type Theorems

Khot, Subhash, Minzer, Dor, Safra, Muli

Journal:

SIAM Journal on Computing

Year:

2018

Language:

english

File:

PDF, 583 KB

english, 2018

47

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Dinur, Irit, Khot, Subhash, Perkins, Will, Safra, Muli

Year:

2010

Language:

english

File:

PDF, 448 KB

english, 2010

48

[IEEE 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2008.10.25-2008.10.28)] 2008 49th Annual IEEE Symposium on Foundations of Computer Science - Hardness of Minimizing and Learning DNF Expressions

Khot, Subhash, Saket, Rishi

Year:

2008

Language:

english

File:

PDF, 364 KB

english, 2008

49

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors

Khot, Subhash, Saket, Rishi

Year:

2014

Language:

english

File:

PDF, 352 KB

english, 2014

50

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies

Khot, Subhash, Naor, Assaf

Year:

2007

Language:

english

File:

PDF, 340 KB

english, 2007

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски